منابع مشابه
Quasi-Minimal, Pseudo-Minimal Systems and Dense Orbits
Minimal sets are an important aspect in the theory of dynamical systems. A new phenomenon are the quasi-minimal sets which appear for example for the Cherry-flow and only few is known about those sets. We say that a dynamical system (group action) (X,T ) is pseudo-minimal if there exists an open set U such that for all x ∈ U the orbit O(x) = {xt | t ∈ T } is dense. One could also say that the s...
متن کاملOn Period Minimal Pseudo-anosov Braids
A family of period minimal pseudo-Anosov braids, one for each pair of Farey neighbors in (0, 1/2], is described.
متن کاملBounds on the Pseudo-Weight of Minimal Pseudo-Codewords of Projective Geometry Codes
In this paper we focus our attention on a family of finite geometry codes, called type-I projective geometry low-density parity-check (PGLDPC) codes, that are constructed based on the projective planes PG(2, q). In particular, we study their minimal codewords and pseudo-codewords, as it is known that these vectors characterize completely the code performance under maximum-likelihood decoding an...
متن کاملPerfect Hashing with Pseudo-minimal Bottom-up Deterministic Tree Automata
We describe a technique that maps unranked trees to their hash codes using a bottom-up deterministic tree automaton (DTA). In contrast to techniques implemented with minimal tree automata, our procedure builds a pseudo-minimal DTA. Pseudo-minimal automata are larger than the minimal ones but in turn the mapping can be arbitrary, so it can be determined prior to the automaton construction. We al...
متن کاملDepth-first Search for Pseudo-intents through Minimal Transversals
The enumeration of pseudo-intents is a long-standing problem in which the order plays a major role. In this paper, we present new algorithms that enumerate pseudo-intents in orders that do not necessarily respect the inclusion relation. We show that, confirming established results, this enumeration is equivalent to computing minimal transversals in hypergraphs a bounded number of times.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2000
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(99)00022-5